A note on uniquely pancyclic graphs
نویسنده
چکیده
In this paper we consider uniquely pancyclic graphs, i.e. n vertex graphs with exactly one cycle of each length from 3 to n. The first result of the paper gives new upper and lower bounds on the number of edges in a uniquely pancyclic graph. Next we report on a computer search for new uniquely pancyclic graphs. We found that there are no new such graphs on n ≤ 59 vertices and that there are no uniquely pancyclic graphs with exactly 5 chords.
منابع مشابه
A Note on the Pancyclism of Block Intersection Graphs of Universal-Friend Friendship Hypergraphs
In this note, we consider the i-block intersection graphs (i-BIG) of a universal-friend friendship 3-hypergraph and show that they are pancyclic for i = 1, 2. We also show that the 1-BIG of a universalfriend friendship 3-hypergraph is Hamiltonian-connected.
متن کاملOn cycles in intersection graphs of rings
Let $R$ be a commutative ring with non-zero identity. We describe all $C_3$- and $C_4$-free intersection graph of non-trivial ideals of $R$ as well as $C_n$-free intersection graph when $R$ is a reduced ring. Also, we shall describe all complete, regular and $n$-claw-free intersection graphs. Finally, we shall prove that almost all Artin rings $R$ have Hamiltonian intersection graphs. ...
متن کاملA note on extending Bondy's meta-conjecture
A graph of order n ≥ 3 is said to be pancyclic if it contains a cycle of each length from 3 to n. A chord of a cycle is an edge between two nonadjacent vertices of the cycle. A chorded cycle is a cycle containing at least one chord. We define a graph of order n ≥ 4 to be chorded pancyclic if it contains a chorded cycle of each length from 4 to n. In this article, we prove the following: If G is...
متن کاملStrongly pancyclic and dual-pancyclic graphs
Say that a cycle C almost contains a cycle C− if every edge except one of C− is an edge of C. Call a graph G strongly pancyclic if every nontriangular cycle C almost contains another cycle C− and every nonspanning cycle C is almost contained in another cycle C. This is equivalent to requiring, in addition, that the sizes of C− and C differ by one from the size of C. Strongly pancyclic graphs ar...
متن کاملSolis Graphs and Uniquely Metric Basis Graphs
A set $Wsubset V (G)$ is called a resolving set, if for every two distinct vertices $u, v in V (G)$ there exists $win W$ such that $d(u,w) not = d(v,w)$, where $d(x, y)$ is the distance between the vertices $x$ and $y$. A resolving set for $G$ with minimum cardinality is called a metric basis. A graph with a unique metric basis is called a uniquely dimensional graph. In this paper, we establish...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Australasian J. Combinatorics
دوره 44 شماره
صفحات -
تاریخ انتشار 2009